Testing additive integrality gaps
نویسندگان
چکیده
منابع مشابه
Convex Relaxations and Integrality Gaps
We discuss the effectiveness of linear and semidefinite relaxations in approximating the optimum for combinatorial optimization problems. Various hierarchies of these relaxations, such as the ones defined by Lovász and Schrijver [47], Sherali and Adams [55] and Lasserre [42] generate increasingly strong linear and semidefinite programming relaxations starting from a basic one. We survey some po...
متن کاملInapproximability Reductions and Integrality Gaps
In this thesis we prove intractability results for several well studied problems in combinatorial optimization. Closest Vector Problem with Pre-processing (CVPP): We show that the pre-processing version of the well known Closest Vector Problem is hard to approximate to an almost polynomial factor (2 1− ) unless NP is in quasi polynomial time. The approximability of CVPP is closely related to th...
متن کاملIntegrality Gaps for Bounded Color Matchings
We investigate the performance of two common lift-and-project techniques, the SheraliAdams (SA) and the Balas, Ceria and Cornuéjols (BCC) hierarchies, on the natural linear relaxation of the Bounded Color Matching polyhedron and generalizations. We prove the following unconditional inapproximability results: even a large family of linear programs, generated by an asymptotically linear number of...
متن کاملImproving Integrality Gaps via Chvátal-Gomory Rounding
In this work, we study the strength of the Chvátal-Gomory cut generating procedure for several hard optimization problems. For hypergraph matching on k-uniform hypergraphs, we show that using Chvátal-Gomory cuts of low rank can reduce the integrality gap significantly even though Sherali-Adams relaxation has a large gap even after linear number of rounds. On the other hand, we show that for oth...
متن کاملFirefighting on Trees Beyond Integrality Gaps
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. Despite considerable progress on several fronts, the approximability of these problems is still badly understood. This is the case even when the underlying graph is a tree, which is one of the most-studied graph struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2012
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-012-0518-y